Suffix Arrays for Spaced-SNP Databases
نویسنده
چکیده
Single-nucleotide polymorphisms (SNPs) account for most variations between human genomes. We show how, if the genomes in a database differ only by a reasonable number of SNPs and the substrings between those SNPs are unique, then we can store a fast compressed suffix array for that database.
منابع مشابه
Compressed Spaced Suffix Arrays
Spaced seeds are important tools for similarity search in bioinformatics, and using several seeds together often significantly improves their performance. With existing approaches, however, for each seed we keep a separate linear-size data structure, either a hash table or a spaced suffix array (SSA). In this paper we show how to compress SSAs relative to normal suffix arrays (SAs) and still su...
متن کاملOn the Optimum Directivity of Uniformly Spaced Broadside Arrays of Parallel Half-Wave Dipoles (RESEARCH NOTES)
The nominal directivity for uniformly spaced broadside parallel half-wave dipoles associated with a uniform excitation is evaluated. The amplitude distribution for an optimized directivity is then obtained for different numbers of elements with the separations between the dipoles as a variable. The optimum and nominal directivities are compared for different spacings of the elements. While thes...
متن کاملDistributed Query Processing Using Suffix Arrays
Suffix arrays are more efficient than inverted files for solving complex queries in a number of applications related to text databases. Examples arise when dealing with biological or musical data or with texts written in oriental languages, and when searching for phrases, approximate patterns and, in general, regular expressions involving separators. In this paper we propose algorithms for proc...
متن کاملA bioinformatician’s guide to the forefront of suffix array construction algorithms
The suffix array and its variants are text-indexing data structures that have become indispensable in the field of bioinformatics. With the uninitiated in mind, we provide an accessible exposition of the SA-IS algorithm, which is the state of the art in suffix array construction. We also describe DisLex, a technique that allows standard suffix array construction algorithms to create modified su...
متن کاملSuffix arrays: what are they good for?
Recently the theoretical community has displayed a flurry of interest in suffix arrays, and compressed suffix arrays. New, asymptotically optimal algorithms for construction, search, and compression of suffix arrays have been proposed. In this talk we will present our investigations into the practicalities of these latest developments. In particular, we investigate whether suffix arrays can ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1407.0114 شماره
صفحات -
تاریخ انتشار 2014